Byzantine Gathering in Networks with Authenticated Whiteboards
نویسندگان
چکیده
We propose an algorithm for the gathering problem of mobile agents in Byzantine environments. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is known to agents. Since the existing algorithm achieves gathering without a whiteboard in Õ(nλ) time, where n is the number of nodes and λ is the length of the longest ID, our algorithm shows an authenticated whiteboard can significantly reduce the time for the gathering problem in Byzantine en-
منابع مشابه
Partially Authenticated Algorithms for Byzantine Agreement
Byzantine agreement is a fundamental issue in fault-tolerant and secure distributed computing. Protocols solving Byzantine agreement guarantee that a sender can transmit a value to a group of receivers consistently, even if some of the nodes, including the sender, are arbitrarily faulty. In the past, protocols for Byzantine agreement were generally either authenticated or non-authenticated. Non...
متن کاملAn On-Demand Byzantine-Resilient Secure Routing Protocol for Wireless Adhoc Networks
Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. We refer to any arbitrary action by authenticated nodes resulting in disruption of the routing service such as drop packets, modify packets and miss-route packets as Byzantine behavior, and to such an adversary as a Byzantine adversary. Nodes may exhibit Byzantine beh...
متن کاملMitigating Byzantine Attacks in Ad Hoc Wireless Networks
Attacks where adversaries have full control of a number of authenticated devices and behave arbitrarily to disrupt the network are referred to as Byzantine attacks. Traditional secure routing protocols are vulnerable to this class of attacks since they usually assume that once authenticated, a node can be trusted to execute the protocol correctly. We present a detailed description of several By...
متن کاملReliable Communication over Partially Authenticated Networks
Reliable communication between parties in a network is a basic requirement for executing any protocol. In this work, we consider the eeect on reliable communication when some pairs of parties have common authentication keys. The pairs sharing keys deene a natural \authentication graph", which may be quite diierent from the \com-munication graph" of the network. We characterize when reliable com...
متن کاملTime-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus
To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated to solve the consensus problem.The first, relies on the addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017